TLA + Proofs
نویسندگان
چکیده
TLA is a specification language based on standard set theory and temporal logic that has constructs for hierarchical proofs. We describe how to write TLA proofs and check them with TLAPS, the TLA Proof System. We use Peterson’s mutual exclusion algorithm as a simple example to describe the features of TLAPS and show how it and the Toolbox (an IDE for TLA) help users to manage large, complex proofs.
منابع مشابه
A TLA+ Proof System
We describe an extension to the TLA specification language with constructs for writing proofs and a proof environment, called the Proof Manager (PM), to checks those proofs. The language and the PM support the incremental development and checking of hierarchically structured proofs. The PM translates a proof into a set of independent proof obligations and calls upon a collection of back-end pro...
متن کاملA Definitional Encoding of TLA* in Isabelle/HOL
We mechanise the logic TLA∗ [8], an extension of Lamport’s Temporal Logic of Actions (TLA) [5] for specifying and reasoning about concurrent and reactive systems. Aiming at a framework for mechanising the verification of TLA (or TLA∗) specifications, this contribution reuses some elements from a previous axiomatic encoding of TLA in Isabelle/HOL by the second author [7], which has been part of ...
متن کاملVerifying Safety Properties with the TLA+ Proof System
TLAPS, the TLA proof system, is a platform for the development and mechanical verification of TLA proofs. The TLA proof language is declarative, and understanding proofs requires little background beyond elementary mathematics. The language supports hierarchical and non-linear proof construction and verification, and it is independent of any verification tool or strategy. Proofs are written in ...
متن کاملA TLA Solution to the RPC-Memory Specification Problem
We present a complete solution to the Broy Lamport speci cation problem Our speci cations are written in TLA a formal lan guage based on TLA We give the high levels of structured proofs and sketch the lower levels which will appear in full elsewhere
متن کاملOn TLA as a logic
As a logic TLA has a precise syntax and semantics We de ne these in the next section Our intent is not to develop a new TLA but rather to explain and to re ne Lamport s de nition of TLA Like HOL and other logics TLA can serve for representing reac tive systems in several styles In particular a speci cation may describe concurrent steps as interleaved or simultaneous communication between compon...
متن کامل